منابع مشابه
A Natural Deduction System for Intuitionistic Fuzzy Logic
Intuitionistic fuzzy logic IF was introduced by Takeuti and Titani. This logic coincides with the first-order Gödel logic based on the real unit interval [0, 1] as set of truth-values. We present a natural deduction system NIF for IF . NIF is defined by suitably translating a first-order extension of Avron’s hypersequent calculus for Gödel logic. Soundness, completeness and normal form theorems...
متن کاملNatural Deduction for Hybrid Logic
In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinar...
متن کاملA Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory, such as LEGO, Coq, etc. In fact, ND-style systems are the kind of systems which can take best advantage of the possibility of reasoning “under assumptions” offered by proof assistants generated by Logical Frameworks....
متن کاملNatural Deduction for Sublogics of Predicate Logic
This work gives a natural deduction presentations to some of the sublogic of predicate logic vB94] and also to some of Alechina and J. van Benthem's sublogics. These presentations are based on BM92, Ben95, Gab94] and Gabbay's Labelled Deductive System LDS Gab94]. It also proves some correspondence results for the sublogics presented in vB94] and some completeness theorem to the classes of model...
متن کاملNormal Natural Deduction Proofs (in classical logic)
Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1976
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093887540